Synchronization of Grammars
نویسندگان
چکیده
Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizing previous sub-classes such as visibly and height-deterministic pushdown automata. The languages recognized by grammars synchronized by a given grammar form an effective boolean algebra lying between regular languages and deterministic context-free languages. We also provide a sufficient condition to obtain the closure under concatenation and its iteration.
منابع مشابه
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages...
متن کاملLength Synchronization Context-Free Grammars
We propose a new type of regulation on the derivation of a context-free grammar: the productions used for passing from a level of a derivation tree to the next level should have the right-hand members of the same length. We prove that such length synchronized context-free grammars characterize the family of ET0L languages, and therefore are equivalent with the synchronization context-free gramm...
متن کاملSynchronous and Multicomponent Tree-Adjoining Grammars: Complexity, Algorithms and Linguistic Applications
This thesis addresses the design of appropriate formalisms and algorithms to be used for natural language processing. This entails a delicate balance between the ability of a formalism to capture the linguistic generalizations required by natural language processing applications and the ability of a natural language processing application based on the formalism to process the formalism efficien...
متن کاملPetri Net DAG Languages and Regular Tree Languages with Synchronization
A true-concurrency semantics is often given via pomsets. A pomset is an abstract directed acyclic graph that is in addition transitive: any grandson of a node is also a son of that node. We will drop this rather artificial transitive property in this paper and research abstract directed acyclic graphs (dags) as a true-concurrency semantics for Petri nets and their relation to regular languages ...
متن کاملSynchronous Formal Systems Based on Grammars and Transducers
This paper is an extended abstract of a doctoral thesis which studies synchronous formal systems based on grammars and transducers, investigating both theoretical properties and practical application perspectives. It introduces new concepts and definitions building upon the well-known principles of regulated rewriting and synchronization. An alternate approach to synchronization of context-free...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008